On Decomposition of Stochastic Finite-State Systems

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Loop-Free Decomposition of Stochastic Finite-State Systems

Two generalizations of Bacon's theory of loop-free decomposition of probabilistic finite-state systems are proposed. The first of these consists of a modification of the structure of the decomposition which then allows for the decomposition of a larger class of systems. The second generalization subsumes the first: sufficient conditions for a stochastic finite-state system to be decomposable fo...

متن کامل

Stochastic finite-state systems in control theory

This paper is concerned, in the main, with a problem of pursuit–evasion in the context of a stochastic finite-state system. Two cases are considered: (a) non-competitive pursuit in which the target does not try to evade the pursuer; and (b) a competitive case in which the aim of the target is to maximize the time of interception, and that of the pursuer is to minimize it. Employing dynamic prog...

متن کامل

Whirl Decomposition of Stochastic Systems

Using a technique based on "state splitting" it is shown that every n-state Markov system is decomposable into a whirl interconnection of n 1 two-state Markov systems.

متن کامل

Functional Decomposition of Composite Finite State Machines

Many of the multiway general decompositions of nite state machines (FSMs) proposed in the past are concerned with the cost reduction of the eventual logic level implementation. In this paper we propose a new method of decomposing a new FSM model called Composite Finite State Machines (CFSMs), which is ideal for use in a microprocessor based system design environment. Our algorithm partitions th...

متن کامل

Finite - State Concurrent Systems ?

Temporal logic model checking is an automatic technique for verifying nite-state concurrent systems. Speciications are expressed in a propositional temporal logic, and the concurrent system is modeled as a state-transition graph. An eecient search procedure is used to determine whether or not the state-transition graph sat-isses the speciication. When the technique was rst developed ten years a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: DAIMI Report Series

سال: 1973

ISSN: 2245-9316,0105-8517

DOI: 10.7146/dpb.v2i8.6423